Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number
نویسندگان
چکیده
Let r(= r(n))!1 with 3 r n1 for an arbitrarily small constant > 0, and let Gr denote a graph chosen uniformly at random from the set of r-regular graphs with vertex set f1; 2; : : : ; ng. We prove that with probability tending to 1 as n!1, Gr has the following properties: the independence number of Gr is asymptotically 2n log r r and the chromatic number of Gr is asymptotically r 2 log r .
منابع مشابه
Intersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملOn the Game Chromatic Number of Sparse Random Graphs
Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of G are colored. The game chromatic number χg(G) is the minimum k for which the first player has a winning strategy. The paper [6] began the analysis of the asymptotic b...
متن کاملOn random regular graphs with non-constant degree
We study random r-regular labelled graphs with n vertices. For r = 0(n ) we give the asymptotic number of them and show that they are almost all r-connected and hamiltonian. Proofs are based on the analysis of a simple algorithm for finding "almost" random regular graphs. (Diversity Libraries §
متن کاملRandom regular graphs of non-constant degree: Concentration of the chromatic number
In this work we show that with high probability the chromatic number of a graph sampled from the random regular graph model Gn,d for d = o(n ) is concentrated in two consecutive values, thus extending a previous result of Achlioptas and Moore. This concentration phenomena is very similar to that of the binomial random graph model G(n, p) with p = d n . Our proof is largely based on ideas of Alo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 11 شماره
صفحات -
تاریخ انتشار 2002